package sandbox.projecteuler;

import java.math.BigInteger;
import java.util.ArrayList;
import java.util.List;

public class ProjectEuler {

	public void problem1() {
		int[] multiplesOf = {3, 5};
		int limit = 1000;
		
		List<Integer> multiples = new ArrayList<Integer>();
		for (int i = 1; i < limit; i++) {
			for (int k : multiplesOf) {
				if (i % k == 0) {
					multiples.add(Integer.valueOf(i));
					break;
				}
			}
		}
		
		int sum = 0;
		for (Integer i : multiples) {
			sum += i.intValue();
		}
		
		System.out.println(sum);
	}
	
	public void problem2() {
		int fib1 = 1;
		int fib2 = 2;
		int limit = 4000000;
		
		List<Integer> evenFibs = new ArrayList<Integer>();
		evenFibs.add(Integer.valueOf(fib2));
		
		int nextFib = fib1 + fib2;
		while (nextFib <= limit) {
			if (nextFib % 2 == 0) {
				evenFibs.add(Integer.valueOf(nextFib));
			}
			fib1 = fib2;
			fib2 = nextFib;
			nextFib = fib1 + fib2;
		}
		
		int sum = 0;
		for (Integer l : evenFibs) {
			sum += l.longValue();
		}
		
		System.out.println(sum);
	}
	
	public void problem3() {
		long num = 600851475143L;
		long maxPrime = 0;
		
		for (BigInteger i = new BigInteger("3"); i.longValue() < num / 71; i = i.nextProbablePrime()) {
			if (num % i.longValue() == 0) {
				System.out.println(i);
				BigInteger j = new BigInteger(Long.toString(num / i.longValue()));
				if (j.isProbablePrime(1)) {
					maxPrime = i.longValue();
					break;
				}
				maxPrime = i.longValue();
			}
		}
		
		System.out.println(maxPrime);
	}
	
	public void problem4() {
		int limit = 999;
		int largestPalindromeProduct = 0;
		for (int i = limit; i > 0; i--) {
			for (int j = limit; j > 0; j--) {
				int product = i * j;
				if (ProjectEulerUtils.isPalindrome(Integer.toString(product))) {
					largestPalindromeProduct = Math.max(largestPalindromeProduct, product);
				}
			}
		}
		System.out.println(largestPalindromeProduct);
	}
	
	public void problem5() {
		int limit = 20;
		
		int smallestMultiple = limit;
		
		boolean found = false;
		while (!found) {
			smallestMultiple++;
			found = true;
			for (int i = 2; i < limit; i++) {
				if (smallestMultiple % i != 0) {
					found = false;
					break;
				}
			}
		}
		
		System.out.println(smallestMultiple);
	}

	public void problem6() {
		int limit = 100;
		
		System.out.println(ProjectEulerUtils.squareOfSum(limit) - ProjectEulerUtils.sumOfSquares(limit));
	}

	public void problem7() {
		BigInteger prime = new BigInteger(Integer.toString(2));
		int count = 1;
		int limit = 10001;
		
		while (count < limit) {
			prime = prime.nextProbablePrime();
			count++;
		}
		
		System.out.println(prime);
	}

	public void problem8() {
		String series = "73167176531330624919225119674426574742355349194934" +
				"96983520312774506326239578318016984801869478851843" +
				"85861560789112949495459501737958331952853208805511" +
				"12540698747158523863050715693290963295227443043557" +
				"66896648950445244523161731856403098711121722383113" +
				"62229893423380308135336276614282806444486645238749" +
				"30358907296290491560440772390713810515859307960866" +
				"70172427121883998797908792274921901699720888093776" +
				"65727333001053367881220235421809751254540594752243" +
				"52584907711670556013604839586446706324415722155397" +
				"53697817977846174064955149290862569321978468622482" +
				"83972241375657056057490261407972968652414535100474" +
				"82166370484403199890008895243450658541227588666881" +
				"16427171479924442928230863465674813919123162824586" +
				"17866458359124566529476545682848912883142607690042" +
				"24219022671055626321111109370544217506941658960408" +
				"07198403850962455444362981230987879927244284909188" +
				"84580156166097919133875499200524063689912560717606" +
				"05886116467109405077541002256983155200055935729725" +
				"71636269561882670428252483600823257530420752963450";
		
		int numberOfAdjacentDigits = 13;
		long max = 0;
		
		for (int i = 0; i < series.length() - numberOfAdjacentDigits; i++) {
			long product = 1;
			for (int j = i; j < i + numberOfAdjacentDigits; j++) {
				product *= Long.parseLong(series.substring(j, j + 1));
			}
			max = Math.max(product, max);
		}
		
		System.out.println(max);
	}

	public void problem9() {
		for (int a = 1; a < 1000; a++) {
			for (int b = 1; b < 1000; b++) {
				for (int c = 1; c < 1000; c++) {
					if (a + b + c == 1000) {
						if ((a * a) + (b * b) == (c * c)) {
							System.out.println(a * b * c);
						}
					} else if (a + b + c > 1000) {
						break;
					}
				}
			}
		}
	}
	
	public void problem10() {
		BigInteger prime = new BigInteger(Integer.toString(2));
		int limit = 2000000;
		long sum = 0;
		
		for ( ; prime.intValue() < limit; prime = prime.nextProbablePrime()) {
			sum += prime.longValue();
		}
		
		System.out.println(sum);
	}

	public void problem11() {
		int[][] grid = {
				{ 8,  2, 22, 97, 38, 15,  0, 40,  0, 75,  4,  5,  7, 78, 52, 12, 50, 77, 91,  8},
				{49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48,  4, 56, 62,  0},
				{81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30,  3, 49, 13, 36, 65},
				{52, 70, 95, 23,  4, 60, 11, 42, 69, 24, 68, 56,  1, 32, 56, 71, 37,  2, 36, 91},
				{22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80},
				{24, 47, 32, 60, 99,  3, 45,  2, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50},
				{32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70},
				{67, 26, 20, 68,  2, 62, 12, 20, 95, 63, 94, 39, 63,  8, 40, 91, 66, 49, 94, 21},
				{24, 55, 58,  5, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72},
				{21, 36, 23,  9, 75,  0, 76, 44, 20, 45, 35, 14,  0, 61, 33, 97, 34, 31, 33, 95},
				{78, 17, 53, 28, 22, 75, 31, 67, 15, 94,  3, 80,  4, 62, 16, 14,  9, 53, 56, 92},
				{16, 39,  5, 42, 96, 35, 31, 47, 55, 58, 88, 24,  0, 17, 54, 24, 36, 29, 85, 57},
				{86, 56,  0, 48, 35, 71, 89,  7,  5, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58},
				{19, 80, 81, 68,  5, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77,  4, 89, 55, 40},
				{ 4, 52,  8, 83, 97, 35, 99, 16,  7, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66},
				{88, 36, 68, 87, 57, 62, 20, 72,  3, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69},
				{ 4, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18,  8, 46, 29, 32, 40, 62, 76, 36},
				{20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74,  4, 36, 16},
				{20, 73, 35, 29, 78, 31, 90,  1, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57,  5, 54},
				{ 1, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52,  1, 89, 19, 67, 48}
				};
	}

	public void problem12() {
		int numberOfDivisors = 500;
		int triangleNumber = 0;
		
		for (int i = 1; ProjectEulerUtils.numberOfFactors(triangleNumber) <= numberOfDivisors; triangleNumber += i++)
			;
		
		System.out.println(triangleNumber);
	}
	
	public static void main(String[] args) {
		ProjectEuler pe = new ProjectEuler();
		pe.problem12();
	}

}